ℓ1-Analysis minimization and generalized (co-)sparsity: When does recovery succeed?
نویسندگان
چکیده
منابع مشابه
$\ell^1$-Analysis Minimization and Generalized (Co-)Sparsity: When Does Recovery Succeed?
This paper investigates the problem of signal estimation from undersampled noisy sub-Gaussian measurements under the assumption of a cosparse model. Based on generalized notions of sparsity, we derive novel recovery guarantees for the `1-analysis basis pursuit, enabling highly accurate predictions of its sample complexity. The corresponding bounds on the number of required measurements do expli...
متن کاملEnhancing Sparsity by Reweighted l1 Minimization
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained l1 minimization. In this paper, we study a novel method for sparse signal recovery that in many situations outperforms l1 minimization in the sense that substantially fewer measurements are neede...
متن کاملMaximal Sparsity Representation via l1 Minimization
Finding a sparse representation of signals is desired in many applications. For a representation dictionary D and a given signal S ∈ span{D}, we are interested in finding the sparsest vector γ such that Dγ = S. Previous results have shown that if D is composed of a pair of unitary matrices, then under some restrictions dictated by the nature of the matrices involved, one can find the sparsest r...
متن کاملData recovery from corrupted observations via l1 minimization
This paper studies the problem of recovering a signal vector and the corrupted noise vector from a collection of corrupted linear measurements through the solution of a l1 minimization (2.1.2), where the sensing matrix is a partial Fourier matrix whose rows are selected randomly and uniformly from rows of a full Fourier matrix. After choosing the parameter in (2.1.2) appropriately, we show that...
متن کاملOn recovery of sparse signals via l1 minimization
This article considers constrained l1 minimization methods for the recovery of high dimensional sparse signals in three settings: noiseless, bounded error and Gaussian noise. A unified and elementary treatment is given in these noise settings for two l1 minimization methods: the Dantzig selector and l1 minimization with an l2 constraint. The results of this paper improve the existing results in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2021
ISSN: 1063-5203
DOI: 10.1016/j.acha.2020.01.002